Espace de twisteurs d’une variété presque hermitienne de dimension 6

Complexité en espace de l'exploration de graphes

Graph Exploration is a problem motivated by several aspects of theoretical computer science, including logic and computational complexity. It has also numerous applications in robotics. In all these contexts, the amount of memory used by the mobile entity (robot, finite automaton, etc.) performing exploration is a key parameter. In this thesis, we study in depth the space complexity of graph ex...

Un Théorème De Green Presque Complexe

We prove the hyperbolicity of the complement of five lines in general position in an almost complex projective plane, answering a question by S. Ivashkovich.

Reconnaissance de locuteurs par localisation dans un espace de locuteurs de référence

L’opérateur de Laplace-Beltrami en Géométrie presque-Riemannienne

Two-dimensional almost-Riemannian structures are generalized Riemannian structures on surfaces for which a local orthonormal frame is given by a Lie bracket generating pair of vector fields that can become collinear. Generically, the singular set is an embedded one dimensional manifold and there are three type of points: Riemannian points where the two vector fields are linearly independent, Gr...

Espace de Services : Vers une formalisation des Systèmes d'Information Pervasifs

Pervasive Information Systems (PIS) represent the next generation of Information Systems (IS). They differ from both traditional IS and pervasive systems: from the former by the heterogeneity of the pervasive environment to which they belong, and from the latter, by the fact that they must integrate an organization and its strategies. In this paper, we propose a conceptual framework, called ser...